Maximizing the minimum load: The cost of selfishness
نویسندگان
چکیده
منابع مشابه
Maximizing the Minimum Load: The Cost of Selfishness
We consider a scheduling problem on m machines, where each job is controlled by a selfish agent. Each agent is only interested in minimizing its own cost, defined as the total load of the machine that its job is assigned to. We consider the objective of maximizing the minimum load (the value of the cover) over the machines. Unlike the regular makespan minimization problem, which was extensively...
متن کاملThe cost of selfishness for maximizing the minimum load on uniformly related machines
Consider the following scheduling game. A set of jobs, each controlled by a selfish agent, are to be assigned to m uniformly related machines. The cost of a job is defined as the total load on the machine that its job is assigned to. A job is interested in minimizing its cost, while the social objective is maximizing the minimum load (cover) over the machines. This goal is different from the re...
متن کاملMaximizing the Minimum Load for Selfish Agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the regular load balancing problem, this problem has not been considered in this context before. For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with running time that is lin...
متن کاملThe communication cost of selfishness
We consider how many bits need to be exchanged to implement a given decision rule when the mechanism must be ex post or Bayesian incentive compatible. For ex post incentive compatibility, the communication protocol must reveal enough information to calculate monetary transfers to the agents to motivate them to be truthful (agents’ payoffs are assumed to be quasilinear in such transfers). For Ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.02.033